Simulating quantum computers with probabilistic methods

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simulating quantum computers with probabilistic methods

We investigate the boundary between classical and quantum computational power. This work consists of two parts. First we develop new classical simulation algorithms that are centered on sampling methods. Using these techniques we generate new classes of classically simulatable quantum circuits where standard techniques relying on the exact computation of measurement probabilities fail to provid...

متن کامل

Computational Methods for Simulating Quantum Computers

This review gives a survey of numerical algorithms and software to simulate quantum computers. It covers the basic concepts of quantum computation and quantum algorithms and includes a few examples that illustrate the use of simulation software for ideal and physical models of quantum computers.

متن کامل

Simulating Quantum Chaos with Quantum Computers

We study the e ect of quantum non-integrability in quantum computation. A quantum Hamiltonian H = 1 2 (p 2 x + p 2 y + x 2 y 2 ) whose classical counterpart is known to be non-integrable is considered as a candidate of quantum non-integrable Hamiltonian using the Weyl rule. Our analysis illustrates a relation between quantum computability and quantum integrability, whose classical limit corresp...

متن کامل

Simulating chemistry using quantum computers.

The difficulty of simulating quantum systems, well known to quantum chemists, prompted the idea of quantum computation. One can avoid the steep scaling associated with the exact simulation of increasingly large quantum systems on conventional computers, by mapping the quantum system to another, more controllable one. In this review, we discuss to what extent the ideas in quantum computation, no...

متن کامل

Simulating quantum non-integrable systems with quantum computers

An impossibility theorem on approximately simulating quantum non-integrable Hamiltonian systems by quantum computers is presented here. This result is obtained by a quantum-mechanically interpretation of Ge-Marsden's impossibility result about simulating classically non-integrable Hamiltonian systems using integration schemes preserving symplectic (Lie-Poisson) property. Discussion is devoted t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Quantum Information and Computation

سال: 2011

ISSN: 1533-7146,1533-7146

DOI: 10.26421/qic11.9-10-5